package kyssion.leetcode.num51_100;

public class code65_扰乱编码 {

    int[] map;

    public boolean isScramble(String s1, String s2) {
        if (s1.length() != s2.length()) {
            return false;
        }
        for (int a = 0; a < 26; a++) {
            map[a] = 1 << a;
        }
        char[] chars1 = s1.toCharArray();
        char[] chars2 = s2.toCharArray();

        return isScramble(chars1, chars2, 0, chars1.length);
    }

    private boolean isScramble(char[] chars1, char[] chars2, int start, int end) {
        int length = end - start + 1;
        if ((length >> 2) << 2 != length) {

        } else {

        }
        return false;
    }
}
